Fixed-Point Theory, Variational Inequalities, and Its Approximation Algorithms

Fixed-Point Theory, Variational Inequalities, and Its Approximation Algorithms

Iterative Algorithms Approach to Variational Inequalities and Fixed Point Problems

and Applied Analysis 3 for all x, y ∈ C. A mapping A : C → H is said to be α-inverse strongly g-monotone if and only if 〈 Ax −Ay, g x − gy ≥ α∥Ax −Ay∥2, 2.2 for some α > 0 and for all x, y ∈ C. A mapping g : C → C is said to be strongly monotone if there exists a constant γ > 0 such that 〈 g x − gy, x − y ≥ γ∥x − y∥2, 2.3 for all x, y ∈ C. Let B be a mapping ofH into 2 . The effective domain of...

Hybrid Extragradient Iterative Algorithms for Variational Inequalities, Variational Inclusions, and Fixed-Point Problems

We investigate the problem of finding a common solution of a general system of variational inequalities, a variational inclusion, and a fixed-point problem of a strictly pseudocontractive mapping in a real Hilbert space. Motivated by Nadezhkina and Takahashi’s hybrid-extragradient method, we propose and analyze new hybrid-extragradient iterative algorithm for finding a common solution. It is pr...

Iterative algorithms for families of variational inequalities fixed points and equilibrium problems

An extragradient-like approximation method for variational inequalities and fixed point problems

The purpose of this paper is to investigate the problem of finding a common element of the set of fixed points of an asymptotically strict pseudocontractive mapping in the intermediate sense and the set of solutions of a variational inequality problem for a monotone and Lipschitz continuous mapping. We introduce an extragradient-like iterative algorithm that is based on the extragradient-like a...